翻訳と辞書 Words near each other ・ "O" Is for Outlaw ・ "O"-Jung.Ban.Hap. ・ "Ode-to-Napoleon" hexachord ・ "Oh Yeah!" Live ・ "Our Contemporary" regional art exhibition (Leningrad, 1975) ・ "P" Is for Peril ・ "Pimpernel" Smith ・ "Polish death camp" controversy ・ "Pro knigi" ("About books") ・ "Prosopa" Greek Television Awards ・ "Pussy Cats" Starring the Walkmen ・ "Q" Is for Quarry ・ "R" Is for Ricochet ・ "R" The King (2016 film) ・ "Rags" Ragland ・ ! (album) ・ ! (disambiguation) ・ !! ・ !!! ・ !!! (album) ・ !!Destroy-Oh-Boy!! ・ !Action Pact! ・ !Arriba! La Pachanga ・ !Hero ・ !Hero (album) ・ !Kung language ・ !Oka Tokat ・ !PAUS3 ・ !T.O.O.H.! ・ !Women Art Revolution Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク affine shape adaptation ： ウィキペディア英語版 affine shape adaptation Affine shape adaptation is a methodology for iteratively adapting the shape of the smoothing kernels in an affine group of smoothing kernels to the local image structure in neighbourhood region of a specific image point. Equivalently, affine shape adaptation can be accomplished by iteratively warping a local image patch with affine transformations while applying a rotationally symmetric filter to the warped image patches. Provided that this iterative process converges, the resulting fixed point will be ''affine invariant''. In the area of computer vision, this idea has been used for defining affine invariant interest point operators as well as affine invariant texture analysis methods. == Affine-adapted interest point operators == The interest points obtained from the scale-adapted Laplacian blob detector or the multi-scale Harris corner detector with automatic scale selection are invariant to translations, rotations and uniform rescalings in the spatial domain. The images that constitute the input to a computer vision system are, however, also subject to perspective distortions. To obtain interest points that are more robust to perspective transformations, a natural approach is to devise a feature detector that is ''invariant to affine transformations''. Interestingly, affine invariance can be accomplished from measurements of the same multi-scale windowed second moment matrix $\backslash mu$ as is used in the multi-scale Harris operator provided that we extend the regular scale space concept obtained by convolution with rotationally symmetric Gaussian kernels to an ''affine Gaussian scale-space'' obtained by shape-adapted Gaussian kernels (Lindeberg 1994 section 15.3; Lindeberg and Garding 1997). For a two-dimensional image $I$, let $\backslash bar\; =\; (x,\; y)^T$ and let $\backslash Sigma\_t$ be a positive definite 2×2 matrix. Then, a non-uniform Gaussian kernel can be defined as :$g(\backslash bar;\; \backslash Sigma)\; =\; \backslash frac\}\; e^\; \backslash bar/2\}$ and given any input image $I\_L$ the affine Gaussian scale-space is the three-parameter scale-space defined as :$L(\backslash bar;\; \backslash Sigma\_t)\; =\; \backslash int\_;\; \backslash Sigma\_t)\; \backslash ,\; d\backslash bar.$ Next, introduce an affine transformation $\backslash eta\; =\; B\; \backslash xi$ where $B$ is a 2×2-matrix, and define a transformed image $I\_R$ as :$I\_L(\backslash bar)\; =\; I\_R(\backslash bar)$. Then, the affine scale-space representations $L$ and $R$ of $I\_L$ and $I\_R$, respectively, are related according to :$L(\backslash bar,\; \backslash Sigma\_L)\; =\; R(\backslash bar,\; \backslash Sigma\_R)$ provided that the affine shape matrices $\backslash Sigma\_L$ and $\backslash Sigma\_R$ are related according to :$\backslash Sigma\_R\; =\; B\; \backslash Sigma\_L\; B^T$. Disregarding mathematical details, which unfortunately become somewhat technical if one aims at a precise description of what is going on, the important message is that ''the affine Gaussian scale-space is closed under affine transformations''. If we, given the notation $\backslash nabla\; L\; =\; (L\_x,\; L\_y)^T$ as well as local shape matrix $\backslash Sigma\_t$ and an integration shape matrix $\backslash Sigma\_s$, introduce an ''affine-adapted multi-scale second-moment matrix'' according to :$\backslash mu\_L(\backslash bar;\; \backslash Sigma\_t,\; \backslash Sigma\_s)\; =\; g(\backslash bar\; -\; \backslash bar;\; \backslash Sigma\_s)\; \backslash ,\; \backslash left(\; \backslash nabla\_L(\backslash bar;\; \backslash Sigma\_t)\; \backslash nabla\_L^T(\backslash bar;\; \backslash Sigma\_t)\; \backslash right)$ it can be shown that under any affine transformation $\backslash bar\; =\; B\; \backslash bar$ the affine-adapted multi-scale second-moment matrix transforms according to :$\backslash mu\_L(\backslash bar;\; \backslash Sigma\_t,\; \backslash Sigma\_s)\; =\; B^T\; \backslash mu\_R(q;\; B\; \backslash Sigma\_t\; B^T,\; B\; \backslash Sigma\_s\; B^T)\; B$. Again, disregarding somewhat messy technical details, the important message here is that ''given a correspondence between the image points $\backslash bar$ and $\backslash bar$, the affine transformation $B$ can be estimated from measurements of the multi-scale second-moment matrices $\backslash mu\_L$ and $\backslash mu\_R$ in the two domains. An important consequence of this study is that if we can find an affine transformation $B$ such that $\backslash mu\_R$ is a constant times the unit matrix, then we obtain a ''fixed-point that is invariant to affine transformations'' (Lindeberg 1994 section 15.4; Lindeberg and Garding 1997). For the purpose of practical implementation, this property can often be reached by in either of two main ways. The first approach is based on ''transformations of the smoothing filters'' and consists of: * estimating the second-moment matrix $\backslash mu$ in the image domain, * determining a new adapted smoothing kernel with covariance matrix proportional to $\backslash mu^$, * smoothing the original image by the shape-adapted smoothing kernel, and * repeating this operation until the difference between two successive second-moment matrices is sufficiently small. The second approach is based on ''warpings in the image domain'' and implies: * estimating $\backslash mu$ in the image domain, * estimating a local affine transformation proportional to $\backslash hat\; =\; \backslash mu^$ where $\backslash mu^$ denotes the square root matrix of $\backslash mu$, * warping the input image by the affine transformation $\backslash hat^$ and * repeating this operation until $\backslash mu$ is sufficiently close to a constant times the unit matrix. This overall process is referred to as ''affine shape adaptation'' (Lindeberg and Garding 1997; Baumberg 2000; Mikolajczyk and Schmid 2004; Tuytelaars and van Gool 2004; Lindeberg 2008). In the ideal continuous case, the two approaches are mathematically equivalent. In practical implementations, however, the first filter-based approach is usually more accurate in the presence of noise while the second warping-based approach is usually faster. In practice, the affine shape adaptation process described here is often combined with interest point detection automatic scale selection as described in the articles on blob detection and corner detection, to obtain interest points that are invariant to the full affine group, including scale changes. Besides the commonly used multi-scale Harris operator, this affine shape adaptation can also be applied to other types of interest point operators such as the Laplacian/Difference of Gaussian blob operator and the determinant of the Hessian (Lindeberg 2008). Affine shape adaptation can also be used for affine invariant texture recognition and affine invariant texture segmentation. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「affine shape adaptation」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.